skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Search for: All records

Creators/Authors contains: "Peng, Zhangjie"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. This paper investigates reconfigurable intelligent surface (RIS)-assisted secure multiuser communication systems in the presence of hardware impairments (HIs) at the RIS and the transceivers. We jointly optimize the beamforming vectors at the base station (BS) and the phase shifts of the reflecting elements at the RIS so as to maximize the weighted minimum approximate ergodic secrecy rate (WMAESR), subject to the transmission power constraints at the BS and unit-modulus constraints at the RIS. To solve the formulated optimization problem, we first decouple it into two tractable subproblems and then use the block coordinate descent (BCD) method to alternately optimize the subproblems. Two different methods are proposed to solve the two obtained subproblems. The first method transforms each subproblem into a second order cone programming (SOCP) problem by invoking the penalty convex–concave procedure (CCP) method and the closed-form fractional programming (FP) criterion, and then directly solves them by using CVX. The second method leverages the minorization-maximization (MM) algorithm. Specifically, we first derive a concave approximation function, which is a lower bound of the original objective function, and then the two subproblems are transformed into two simple surrogate problems that admit closed-form solutions. Simulation results verify the performance gains of the proposed robust transmission methods over existing non-robust designs. In addition, the MM algorithm is shown to have much lower complexity than the SOCP-based algorithm. 
    more » « less
  2. null (Ed.)
    The implementation of full-duplex (FD) theoretically doubles the spectral efficiency of cellular communications. We propose a multiuser FD cellular network relying on an intelligent reflecting surface (IRS). The IRS is deployed to cover a dead zone while suppressing user-side self-interference (SI) and co-channel interference (CI) by carefully tuning the phase shifts of its massive low-cost passive reflection elements. To ensure network fairness, we aim to maximize the weighted minimum rate (WMR) of all users by jointly optimizing the precoding matrix of the base station (BS) and the reflection coefficients of the IRS. Specifically, we propose a low-complexity minorization-maximization (MM) algorithm for solving the subproblems of designing the precoding matrix and the reflection coefficients, respectively. Simulation results confirm the convergence and efficiency of our proposed algorithm, and validate the advantages of introducing IRS to realize FD cellular communications. 
    more » « less
  3. null (Ed.)